Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
نویسندگان
چکیده
منابع مشابه
Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques studied previously for inversive generators, we bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estima...
متن کاملEngineering Nonlinear Pseudorandom Number Generators
In the era of multi and many-core processors, computer simulations increasingly require parallel, small and fast pseudorandom number generation. Although linear generators lend themselves to a simpler evaluation that ensures favorable properties like guaranteed period, they may adversely affect the result of simulations or be quite large. Conversely, nonlinear generators may provide apparently ...
متن کاملPredicting nonlinear pseudorandom number generators
Let p be a prime and let a and b be elements of the finite field Fp of p elements. The inversive congruential generator (ICG) is a sequence (un) of pseudorandom numbers defined by the relation un+1 ≡ au−1 n +b mod p. We show that if sufficiently many of the most significant bits of several consecutive values un of the ICG are given, one can recover the initial value u0 (even in the case where t...
متن کاملOn the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degree growth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estimates than in the general case and thus can be of use for pseudorandom number generation. DOI: https://do...
متن کاملEmpirical Pseudorandom Number Generators
The most common pseudorandom number generator or PRNG, the linear congruential generator or LCG, belongs to a whole class of rational congruential generators. These generators work by multiplicative congruential method for integers, which implements a ”grow-and-cut procedure”. We extend this concept to real numbers and call this the real congruence, which produces another class of random number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2010
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2009.12.003